منابع مشابه
Robust M-periodogram with dichotomous search
The problem of sinusoidal frequency estimation in heavy-tailed noise environment is addressed. A method based on the robust M -periodogram is proposed. Specifically, a suboptimal coarse frequency estimate provided by the robust M -periodogram is improved using the modified dichotomous search. Simulations that consider most common heavytailed noise models demonstrate that the proposed method out...
متن کاملMinimum Covering with Travel Cost
Given a polygon and a visibility range, the Myopic Watchman Problem with Discrete Vision (MWPDV) asks for a closed path P and a set of scan points S , such that (i) every point of the polygon is within visibility range of a scan point; and (ii) path length plus weighted sum of scan number along the tour is minimized. Alternatively, the bicriteria problem (ii’) aims at minimizing both scan numbe...
متن کاملTravel cost and time measurement in travel cost models TRAVEL COST AND TIME MEASUREMENT IN TRAVEL COST MODELS
In this paper we use the results of a recent on-site recreation survey to know whether it matters to use perceived rather than calculated travel costs. The calculated travel costs (time and money) are derived from detailed GIS computations. The perceived travel times and costs are taken directly from the survey responses. We first find that there is a high non-response rate for the perceived co...
متن کاملNetwork Search Games with Asymmetric Travel Times
A point H is hidden in a rooted tree Q which is endowed with asymmetric distances (travel times) between nodes. We determine the randomized search strategy, starting from the root, which minimizes the expected time to reach H; in the worst case. This is equivalent to a zero-sum search game (Q), with minimizing Searcher, maximizing Hider and payo¤ equal to the capture time. The worst Hiding dist...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1976
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.19.245